A Proof of Yao's Protocol for Secure Two-Party Computation
نویسندگان
چکیده
In the mid 1980’s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide a complete description of Yao’s protocol, along with a rigorous proof of security. Despite the importance of Yao’s protocol to the field of secure computation, to the best of our knowledge, this is the first time that a proof of security has been published.
منابع مشابه
Techniques for Efficient Secure Computation Based on Yao's Protocol
In the setting of secure two-party computation, two parties wish to securely compute a function of their joint private inputs. The theoretical foundations of this problem were laid down in the 1980s, and it has been heavily studied due to its generality and many applications. However, until recently, secure computation was considered a theoretical problem of purely theoretical interest. This ha...
متن کاملOn Secure Two-party Computation
1.1. Secure Two-Party Computation. In essence, secure multiparty computation is the solution to the problem how to compute on private inputs from several parties when we do not trust other parties and we don’t have a central authority who can get inputs, perform computations and give outputs to those that need them. Here we will talk about secure twoparty computation, where Alice, holding xa an...
متن کاملKey Technologies and Applications of Secure Multiparty Computation
With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introdu...
متن کاملEquivocating Yao: Constant-Rounds Adaptively Secure Multiparty Computation in the Plain Model
Yao’s garbling scheme is one of the basic building blocks of crytographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in many ways and has innumerable applications. Still, a basic question has remained open throughout the years: Can the scheme be extended to guarantee security in the face of an adversary that corrupts bo...
متن کاملSolving the Dating Problem with the SENPAI Protocol
The SENPAI protocol (Secure ENcrypted Protocol for Affection Information protocol) builds on work by [1] to allow efficient secure two-party computation on a problem of general interest with security against covert adversaries, while avoiding the overhead of zero-knowledge proofs. We will discuss historical attempts to solve the problem under discussion, followed by an explanation of the SENPAI...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2004 شماره
صفحات -
تاریخ انتشار 2004